Complexity of Linear Standard Theories

We give an algorithm for deciding E-uniication problems for linear standard equational theories (linear equations with all shared variables at a depth less than two) and varity 1 goals (linear equations with no shared variables). We show that the algorithm halts in quadratic time for the non-uniform E-uniication problem, and linear time if the equational theory is varity 1. The algorithm is still polynomial for the uniform problem. The size of the complete set of uniiers is exponential, but membership in that set can be determined in polynomial time. For any goal (not just varity 1) we give a NEXPTIME algorithm.